Reversing Imperative Parallel Programs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reversing Imperative Parallel Programs

We propose an approach and a subsequent extension for reversing imperative programs. Firstly, we produce both an augmented version and a corresponding inverted version of the original program. Augmentation saves reversal information into an auxiliary data store, maintaining segregation between this and the program state, while never altering the data store in any other way than that of the orig...

متن کامل

Synthesizing imperative distributed-memory implementations from functional data-parallel programs

FACULTY OF PHYSICAL SCIENCES AND ENGINEERING DEPARTMENT OF ELECTRONICS AND COMPUTER SCIENCE Doctor of Philosophy by Tristan Aubrey-Jones Distributed memory architectures such as Linux clusters have become increasingly common but remain difficult to program. We target this problem and present a novel technique to automatically generate data distribution plans, and subsequently MPI implementation...

متن کامل

Verification of Logic Programs and Imperative Programs

This paper explores the relationship between veriication of logic programs and imperative programs with the aim of uncovering the kinds of reasoning used to construct logic programs. We discuss forward reasoning, such as that used for verifying imperative programs using the inductive assertion method, and backward reasoning, such as that used for verifying imperative programs using subgoal indu...

متن کامل

Reasoning About Imperative Quantum Programs

A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum states and classical states. The state logic is used to provide a sound Hoare-style calculus for quantum imperative programs. The calculus is illustrated by proving the correctness of the Deutsch algorithm.

متن کامل

Declarative View of Imperative Programs

By giving a declarative meaning to an imperative program, the verification of the imperative program is switched from the imperative paradigm to the declarative or logic paradigm where one can take advantage of, for example, referential transparency. Rather than ‘compiling’ an imperative program to a ‘lower level’ we ‘inverse compile’ the imperative program to the ‘higher’ declarative level. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2017

ISSN: 2075-2180

DOI: 10.4204/eptcs.255.4